#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
const int mod=1e9+7;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],fac[maxn];
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
   	fac[0]=1;
   	for(int i=1;i<maxn;i++) fac[i]=fac[i-1]*i%mod;
    LL t;cin>>t;
    while(t--){
        LL n;cin>>n;
        for(int i=1;i<=n;i++) {
            cin>>a[i];
        }
        LL cnt=a[1];
        for(int i=1;i<=n;i++) cnt&=a[i];
        LL num=0;
        for(int i=1;i<=n;i++){
            if(a[i]==cnt) num++;
        }
        cout<<( num*(num-1)%mod*fac[n-2]%mod)<<endl;
    }
   	return 0;
}
